UNIPoint: Universally Approximating Point Processes Intensities
نویسندگان
چکیده
Point processes are a useful mathematical tool for describing events over time, and so there many recent approaches representing learning them. One notable open question is how to precisely describe the flexibility of point process models whether exists general model that can represent all processes. Our work bridges this gap. Focusing on widely used event intensity function representation processes, we provide proof class learnable functions universally approximate any valid function. The connects well known Stone-Weierstrass Theorem approximation, uniform density non-negative continuous using transfer functions, formulation parameters piece-wise as dynamic system, recurrent neural network implementation capturing dynamics. Using these insights, design implement UNIPoint, novel model, networks parameterise sums basis upon each event. Evaluations synthetic real world datasets show simpler performs better than Hawkes variants more complex network-based approaches. We expect result will practical selecting tuning models, furthering theoretical representational complexity learnability.
منابع مشابه
Exact Simulation of Point Processes with Stochastic Intensities
Point processes with stochastic intensities are ubiquitous in many application areas, including finance, insurance, reliability and queuing. They can be simulated from a standard Poisson process by time-scaling with the cumulative intensity, or compensator. The paths of the compensator are often generated with a discretization method. However, discretization introduces bias into the simulation ...
متن کاملApproximating labelled Markov processes
Labelled Markov processes are probabilistic versions of labelled transition systems. In general, the state space of a labelled Markov process may be a continuum. In this paper, we study approximation techniques for continuous-state labelled Markov processes. We show that the collection of labelled Markov processes carries a Polish-space structure with a countable basis given by finite-state Mar...
متن کاملApproximating Labeled Markov Processes
We study approximate reasoning about continuous-state labeled Markov processes. We show how to approximate a labeled Markov process by a family of finite-state labeled Markov chains. We show that the collection of labeled Markov processes carries a Polish space structure with a countable basis given by finite state Markov chains with rational probabilities. The primary technical tools that we d...
متن کاملApproximating Labelled Markov Processes Again!
Labelled Markov processes are continuous-state fully probabilistic labelled transition systems. They can be seen as co-algebras of a suitable monad on the category of measurable space. The theory as developed so far included a treatment of bisimulation, logical characterization of bisimulation, weak bisimulation, metrics, universal domains for LMPs and approximations. Much of the theory involve...
متن کاملApproximating spatially exclusive invasion processes.
A number of biological processes, such as invasive plant species and cell migration, are composed of two key mechanisms: motility and reproduction. Due to the spatially exclusive interacting behavior of these processes a cellular automata (CA) model is specified to simulate a one-dimensional invasion process. Three (independence, Poisson, and 2D-Markov chain) approximations are considered that ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the ... AAAI Conference on Artificial Intelligence
سال: 2021
ISSN: ['2159-5399', '2374-3468']
DOI: https://doi.org/10.1609/aaai.v35i11.17165